منابع مشابه
Partitioning Subsets of Stable Models
This paper discusses two combinatorial problems in stability theory. First we prove a partition result for subsets of stable models: for any A and B, we can partition A into |B | ) pieces, 〈Ai | i < |B | 〉, such that for each Ai there is a Bi ⊆ B where |Bi| < κ(T ) and Ai |̂ Bi B. Second, if A and B are as above and |A | > |B |, then we try to find A′ ⊂ A and B′ ⊂ B such that |A′| is as large as...
متن کاملA Hierarchy of Tractable Subsets for Computing Stable Models
Finding the stable models of a knowledge base is a signiicant computational problem in artiicial intelligence. This task is at the computational heart of truth maintenance systems, autoepistemic logic, and default logic. Unfortunately, it is NP-hard. In this paper we present a hierarchy of classes of knowledge bases, 1 ; 2 ; :::, with the following properties: rst, 1 is the class of all stratii...
متن کاملA Hierarchy of Tractable Subsets for Computing Stable Models
Finding the stable models of a knowledge base is a signi cant computational problem in arti cial intelligence. This task is at the computational heart of truth maintenance systems, autoepistemic logic, and default logic. Unfortunately, it is NP-hard. In this paper we present a hierarchy of classes of knowledge bases, 1; 2; :::, with the following properties: rst, 1 is the class of all strati ed...
متن کاملSparsifying machine learning models identify stable subsets of predictive features for behavioral detection of autism
Background Autism spectrum disorder (ASD) diagnosis can be delayed due in part to the time required for administration of standard exams, such as the Autism Diagnostic Observation Schedule (ADOS). Shorter and potentially mobilized approaches would help to alleviate bottlenecks in the healthcare system. Previous work using machine learning suggested that a subset of the behaviors measured by ADO...
متن کاملStable Minimum Space Partitioning in Linear Time
In the stable 0-1 sorting problem the task is to sort an array of n elements with two distinct values such that equal elements retain their relative input order. Recently, Munro, Raman and Salowe [BIT 1990] gave an algorithm which solves this problem in O(nlog*n)3 time and constant extra space. We show that by a modification of their method the stable 0-1 sorting is possible in O(n) time and O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2001
ISSN: 0022-4812,1943-5886
DOI: 10.2307/2694983